Set Functors and Generalised Terms
نویسندگان
چکیده
In this paper we use techniques for monad compositions in order to provide a basis for categorical unification in the framework of generalised terms. In particular, we provide results for many-valued sets of terms, and show that this composition of set functors can be extended to a monad.
منابع مشابه
Set functors , L - fuzzy set categories and generalised terms
In this work we generalize previous constructions of fuzzy set categories, introduced in [5], by considering L-fuzzy sets in which the values of the characteristic functions run on a completely distributive lattice, rather than in the unit real interval. Later, these L-fuzzy sets are used to define the L-fuzzy categories, which are proven to be rational. In the final part of the paper, the L-fu...
متن کاملDiscrete Generalised Polynomial Functors
We study generalised polynomial functors between presheaf categories, developing their mathematical theory together with computational applications. The main theoretical contribution is the introduction of discrete generalised polynomial functors, a class that lies in between the classes of cocontinuous and finitary functors, and is closed under composition, sums, finite products, and different...
متن کاملSimilarities between powersets of terms 1
Generalisation of the foundational basis for many-valued logic programming builds upon generalised terms in form of powersets of terms. A categorical approach involving set and term functors as monads allows for a study of monad compositions that provide variable substitutions, and compositions thereof. In this paper, substitutions and unifiers appear as constructs in Kleisli categories related...
متن کاملA graphical approach to monad compositions
Techniques for monad compositions can be used to provide a basis for categorical unification in the framework of generalised terms. In [4], we gave results for the many-valued sets of terms, and showed that this composition of set functors can be extended to a monad. In this work we introduce new sufficient conditions for two monads being composable, and show that the construction in [4] also s...
متن کاملGeneralised Name Abstraction for Nominal Sets
The Gabbay-Pitts nominal sets model provides a framework for reasoning with names in abstract syntax. It has appealing semantics for name binding, via a functor mapping each nominal set to the ‘atomabstractions’ of its elements. We wish to generalise this construction for applications where sets, lists, or other patterns of names are bound simultaneously. The atom-abstraction functor has left a...
متن کامل